Bottom-up dataflow analysis of normal logic programs
نویسندگان
چکیده
منابع مشابه
Semantics-Based Dataflow Analysis of Logic Programs
The increased acceptance of Prolog has motivated widespread interest in the semanticsbased dataflow analysis of logic programs and a number of different approaches have been suggested. However, the relationships between these approaches are not clear. The present paper provides a unifying introduction to the approaches by giving novel denotational semantic definitions which capture their essenc...
متن کاملAnalysis of Normal Logic Programs
In this paper we present a dataaow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w.r.t. SLDNF resolution and optimal w.r.t. constructive negation.
متن کاملEfficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation
B o t t o m u p evaluation of logic programs has recently at tracted much attention in the logic programming and the deductive database field. It is complete [7], and if the number of all possible facts is finite, it is guaranteed to terminate, while t op -down evaluation may not. B o t t o m u p evaluation, however, may be inefficient since it may generate many facts irrelevant to the query. T...
متن کاملRule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in “iterations”, until the fixpoint is reached. However, it is often desirable — and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics — to apply the rules in some order. An important property of a fixpoint evaluation algorithm is that it does not repeat inferences; we say ...
متن کاملA Framework for Bottom Up Specialisation of Logic Programs
In this paper, we develop a solid theoretical foundation for a bottom up program transformation, capable of specialising a logic program with respect to a set of unit clauses. Extending a well-known operator , originally introduced for composing logic programs, we deene a bottom up partial deduction operator and prove correctness of the transformation with respect to the S-semantics. We also sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1992
ISSN: 0743-1066
DOI: 10.1016/0743-1066(92)90031-w